Global k-Level Crossing Reduction
نویسندگان
چکیده
منابع مشابه
Global k-Level Crossing Reduction
Directed graphs are commonly drawn by a four phase framework introduced by Sugiyama et al. in 1981. The vertices are placed on parallel horizontal levels. The edge routing between consecutive levels is computed by solving one-sided 2-level crossing minimization problems, which are repeated in up and down sweeps over all levels. Crossing minimization problems are generally NP-hard. We introduce ...
متن کاملA Global k-Level Crossing Reduction Algorithm
Directed graphs are commonly drawn by the Sugiyama algorithm, where crossing reduction is a crucial phase. It is done by repeated one-sided 2-level crossing minimizations, which are still NP-hard. We introduce a global crossing reduction, which at any particular time captures all crossings, especially for long edges. Our approach is based on the sifting technique and improves the level-by-level...
متن کاملOptimal k-Level Planarization and Crossing Minimization
An important step in laying out hierarchical network diagrams is to order the nodes on each level. The usual approach is to minimize the number of edge crossings. This problem is NP-hard even for two layers when the first layer is fixed. Hence, in practice crossing minimization is performed using heuristics. Another suggested approach is to maximize the planar subgraph, i.e. find the least numb...
متن کاملبررسی آنالیز آمار level crossing
مرحله گذارقطع یک راهکار بسیارسودمند جهت تجزیه وتحلیل سری های زمانی تصادفی است. مادراین پایان نامه با معرفی این روش به تحقیق در مورد سری های زمانی فواصل ضربان قلب و سری زمانی شاخص بورس سهام چندشرکت وزبری سطح دررشد لایه های نازک می پردازیم. دراین روش می توان بااستفاده از تابع توزیع چگالی احتمال ?_?^+ نسبت به ? وهمچنین تابع توزیع چگالی احتمال بیشترین نقاط برخورد نسبت به مقدار شیب، تمایز قلب سالم و...
15 صفحه اولCrossing Reduction for Hierarchical Graphs with Intra-Level Edges
In drawings of hierarchical graphs generated by the conventional Sugiyama framework the vertices are positioned on multiple horizontal level lines. This drawing style which allows edges only between vertices on different levels is well suited for the visualization of a common direction of flow from lower to higher levels in a graph. In this paper we are interested in reordering the vertices on ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2011
ISSN: 1526-1719
DOI: 10.7155/jgaa.00242